Finding low-weight polynomial multiples using discrete logarithm

Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an improvement to this approach using discrete logarithm rather than a direct representation of the involved polynomials. This gives an algorithm which improves the theoretical complexity, and is also very flexible in practice

A Tabular Interpretation of Bottom-up Automata for TAG Eric de la Clergerie

We present a tabular interpretation for a class of 2–Stack Automata that may be used to describe bottom-up parsing strategies for TAGs. The results are also useful for tabulating other existing bottomup automata models for this kind of languages.

Directory Services and WWW integration using SOLO

The starting point of the work presented here, with our background in directory services, was when we started to really use the Web the strong feeling that WWW was really lacking a name resolution protocol in addition to all already existing information search and retrieval functionalities. On the other hand the directory services and White Pages Services we were involved with were lacking a good integration with the available information services. The new SOLO protocol, that we have contributed to define, aims at providing the directory and WP services with several highly desirable features such as simplicity, technology independence, user-friendly naming and a centroid-like indexing scheme. One of our goals with SOLO was to be able to use SOLO to meet the previous paragraph requirements. SOLO protocol is so simple that it took us only a few weeks to implement gateways between SOLO and X.500 or WWW. The next step was the integration of this protocol directly into WWW clients by defini..

A Minimal Extension of the WAM for clp(FD)

We present an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive constraint X in r which embeds the core propagation mechanism. Complex user constraints such as linear equations or inequations are compiled into X in r expressions which encode the propagation scheme chosen to solve the constraint. The uniform treatment of a single primitive constraint leads to a better understanding of the overall constraint solving process and makes possible three main global optimizations which encompass many previous particular optimizations of "black box" finite domains solvers. Implementation results show that this approach combines both simplicity and efficiency. Our clp(FD) system is more than twice as fast as CHIP on average, with peak speedup reaching seven. 1 Introduction Constraint Logic Programming (CLP) has shown to be a very active field of research over recent years, ..

A coarse to fine 3D registration method based on robust fuzzy clustering

An important problem in computer vision is to determine how features extracted from images are connected to an existing model. In this paper, we focus on solving the registration problem, i.e. obtaining rigid transformation parameters between several 3D data sets, whether partial or exhaustive. The difficulty of this problem is to obtain a method which is robust with respect to outliers and at the same time accurate. We present a general method performing robust 3D localization and fitting based on a fuzzy clustering method. The fuzzy set approach is known for its practical efficiency in uncertain environments. To illustrate the advantages of this approach on the registration problem, we show results on synthetic and real 3D data

Refining Tabular Parsers for TAGs

This paper investigates several renements of a generic tabular parser for Tree Adjoining Grammars. The resulting parser is simpler and more ecient in practice, even though the worst case complexity is not optimal